package day_6_29;

public class Main1 {
    /**
     * 72. 编辑距离
     * https://leetcode.cn/problems/edit-distance/description/
     */
    public int minDistance(String word1, String word2) {
        // 将 word1 转换成 word2
        int n = word1.length();
        int m = word2.length();

        // dp[i][j]: 表示字符串word1中的[1,i]区间和word2的[1,j]区间内的编辑距离，就是最小的操作次数
        int[][] dp = new int[n + 1][m + 1];
        for(int i = 0;i <= n;i++) {
            dp[i][0] = i;
        }
        for(int j = 0;j <= m;j++) {
            dp[0][j] = j;
        }

        for(int i = 1;i <= n;i++) {
            for(int j = 1;j <= m;j++) {
                if(word1.charAt(i - 1) == word2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                }else {
                    dp[i][j] = Math.min(Math.min(dp[i][j - 1],dp[i - 1][j]),dp[i - 1][j - 1]) + 1;
                }
            }
        }

        return dp[n][m];
    }
}
